positive divisor

正除数,正因子

English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.

Look at other dictionaries:

  • Divisor — divisible redirects here. For divisibility of groups, see Divisible group. For the second operand of a division, see Division (mathematics). For divisors in algebraic geometry, see Divisor (algebraic geometry). For divisibility in the ring theory …   Wikipedia

  • Divisor function — σ0(n) up to n = 250 Sigma function σ …   Wikipedia

  • Divisor topology — In mathematics, more specifically general topology, the divisor topology is an example of a topology given to the set X of positive integers that are greater than or equal to two, i.e., X = {2, 3, 4, 5, …}. The divisor topology is the poset… …   Wikipedia

  • divisor — noun /dɪ.ˈvaɪ.zə(ɹ),dɪ.ˈvaɪ.zɚ/ a) A number or expression that another is to be divided by. In 42 ÷ 3 the divisor is the 3. b) An integer that exactly divides another integer an integer number of times. The positive divisors of 6 are 1, 2 and 3 …   Wiktionary

  • Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For …   Wikipedia

  • Harmonic divisor number — This article is about harmonic divisor numbers. For meanings of harmonic number, see harmonic number (disambiguation). In mathematics, a harmonic divisor number, or Ore number (named after Øystein Ore who defined it in 1948), is a positive… …   Wikipedia

  • Unitary divisor — In mathematics, a natural number a is a unitary divisor of a number b if a and frac{b}{a} are coprime, having no common factor other than 1. Thus, 5 is a unitary divisor of 60, because 5 and frac{60}{5}=12 have only 1 as a common factor, while 6… …   Wikipedia

  • greatest common divisor — noun The greatest common divisor of a set is the largest positive integer or polynomial that divides each of the numbers in the set without remainder. Syn: greatest common factor, highest common factor …   Wiktionary

  • Fundamental theorem of cyclic groups — In abstract algebra, the fundamental theorem of cyclic groups states that if G, is a cyclic group of order n, then every subgroup of G, is cyclic. Moreover, the order of any subgroup of G, is a divisor of n, and for each positive divisor k, of n …   Wikipedia

  • Cyclic group — Group theory Group theory …   Wikipedia

  • Composite number — A composite number is a positive integer which has a positive divisor other than one or itself. In other words a composite number is any positive integer greater than one that is not a prime number. So, if n > 0 is an integer and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.